On the Insertion Time of Cuckoo Hashing
نویسندگان
چکیده
منابع مشابه
On the Insertion Time of Cuckoo Hashing
Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions. In this paper we investigate further the random walk heuristic for inserting in an online fashion new items into the hash table. Provided that k ≥ 3 and that the ...
متن کاملOn the insertion time of random walk cuckoo hashing
Cuckoo Hashing is a hashing scheme invented by Pagh and Rodler [9]. It uses d ≥ 2 distinct hash functions to insert items into the has table. It has been an open question for some time as to the expected time for Random Walk Insertion to add items. We show that if the number of hash functions d = O(1) is sufficiently large, then the expected insertion time is O(1) per item.
متن کامل1 0 O ct 2 01 3 On the Insertion Time of Cuckoo Hashing ∗
Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions. In this paper we investigate the random walk heuristic for inserting in an online fashion new items into the hash table. Provided that k ≥ 3 and that the number o...
متن کاملCuckoo Hashing
We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...
متن کاملCuckoo Hashing with Pages
Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many settings, where lookups are expensive, cuckoo hashing becomes a less compelling alternative. One such standard setting is when memory is arranged in large pages, and a major cost is the number of page accesses. We propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/100797503